Resurrecting Ada's Rendez-Vous in Java
نویسندگان
چکیده
Java is a programming language designed with concurrency in mind from its inception. However, the synchronization mechanism provided is a restricted version of Hoare’s Monitors, being too low level for most applications. In this paper we propose a high level synchronization mechanism for Java, based on Ada’s Rendez-Vous, adapting the notation and semantics to Java. The result is a nice and readable notation to control concurrency, even cleaner than the Ada original version. The Rendez-Vous syntax adds only one statement to Java, and we developed a preprocessor to translate the new statement to pure Java, using a class library which supports messages. Our implementation is available for downloading over the Internet.
منابع مشابه
Modelling Remote Concurrency with Ada. Case Study of Symmetric Non-deterministic Rendez-vous. Modelling Remote Concurrency with Ada. Case Study of Symmetric Non-deterministic Rendez-vous
When developing concurrent software, a proper engineering practice is to choose a good level of abstraction for expressing concurrency control. Ideally, this level should provide platform-independent abstractions but, as the platform concurrency behaviour cannot be ignored, this abstraction level must also be able to cope with it and exhibit the influence of different possible behaviours. We st...
متن کاملPetri Nets with Non-blocking Arcs are Difficult to Analyze
In this paper, we study the decidability of five problems on a class of extended Petri nets. The study of this class of extended Petri nets is motivated by the problem of parametric verification of multiple copies of processes that can communicate with a partially non-blocking rendez-vous. This kind of communications occurs in abstractions of multi-threaded JAVA programs.
متن کاملA Eulerian approach to the analysis of rendez-vous algorithms
In this paper we analyze rendez-vous algorithms in the situation when agents can only exchange information below a given distance threshold R. We study the system under an Eulerian point of view considering (possibly continuous) probability distributions of agents and we present convergence results both in discrete and in continuous time. The limit distribution is always necessarily a convex co...
متن کاملAn Image-Based Sensor System for Autonomous Rendez-Vous with Uncooperative Satellites
In this paper are described the image processing algorithms developed by SENER, Ingeniería y Sistemas to cope with the problem of image-based, autonomous rendez-vous (RV) with an orbiting satellite. The methods developed have a direct application in the OLEV (Orbital Life Extension Extension Vehicle) mission. OLEV is a commercial mission under development by a consortium formed by Swedish Space...
متن کاملPartial Order Reduction in Presence of Rendez-vous Communications with Priority Choice and Weak Fairness
If synchronizing (rendez-vous) communications are used in Promela models, the priority choice feature (unless construct) and the weak fairness algorithm are not compatible with the partial order reduction algorithm used in Spin’s verifier. After identifying the wrong partial order reduction pattern that causes both incompatibilities, we give solutions to these two problems. To this end we propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998